Cyclic coordinate descent in a class of bang–singular–bang problems
نویسندگان
چکیده
منابع مشابه
Cyclic coordinate descent in a class of bang-singular-bang problems
with zi ∈ { Ĉ[0, T ] |zi(0) = 0, zi(T ) = bi } , with technical constraints for the consumption rate over time: mi ≤ żi(t) ≤Mi, ∀i = 1, . . . , n. We abstract from this situation to tackle a general problem which studies a production process whose efficiency of production with respect to each input depends on time, on the stock of the various inputs, and on the consumption rate of other inputs....
متن کاملWhen Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent
Coordinate descent (CD) method is a classical optimization algorithm that has seen a revival of interest because of its competitive performance in machine learning applications. A number of recent papers provided convergence rate estimates for their deterministic (cyclic) and randomized variants that differ in the selection of update coordinates. These estimates suggest randomized coordinate de...
متن کاملAnalyzing Random Permutations for Cyclic Coordinate Descent
We consider coordinate descent methods on convex quadratic problems, in which exact line searches are performed at each iteration. (This algorithm is identical to Gauss-Seidel on the equivalent symmetric positive definite linear system.) We describe a class of convex quadratic problems for which the random-permutations version of cyclic coordinate descent (RPCD) outperforms the standard cyclic ...
متن کاملCyclic coordinate descent: A robotics algorithm for protein loop closure.
In protein structure prediction, it is often the case that a protein segment must be adjusted to connect two fixed segments. This occurs during loop structure prediction in homology modeling as well as in ab initio structure prediction. Several algorithms for this purpose are based on the inverse Jacobian of the distance constraints with respect to dihedral angle degrees of freedom. These algor...
متن کاملThe cyclic coordinate descent in hydrothermal optimization problems with non-regular Lagrangian
In this paper we present an algorithm, inspired by the cyclic coordinate descent method, which allows the resolution of hydrothermal optimization problems involving pumped-storage plants. The proof of the convergence of the succession generated by the algorithm was based on the use of an appropriate adaptation of Zangwill’s global theorem of convergence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.03.003